Relations in doubly laced crystal graphs via discrete Morse theory

Computing Persistent Homology via Discrete Morse Theory

This report provides theoretical justification for the use of discrete Morse theory for the computation of homology and persistent homology, an overview of the state of the art for the computation of discrete Morse matchings and motivation for an interest in these computations, particularly from the point of view of topological data analysis. Additionally, a new simulated annealing based method...

Discrete Morse Theory and the Homotopy Type of Clique Graphs

We attach topological concepts to a simple graph by means of the simplicial complex of its complete subgraphs. Using Forman’s discrete Morse theory we show that the strong product of two graphs is homotopic to the topological product of the spaces of their complexes. As a consequence, we enlarge the class of clique divergent graphs known to be homotopy equivalent to all its iterated clique graphs.

Equivariant discrete Morse theory

In this paper, we study Forman's discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. As an application, we determine the C2 × Sn−2-homotopy type of the complex of non-connected graphs on n nodes.

Morse Theory on Graphs

Let Γ be a finite d-valent graph and G an n-dimensional torus. An " action " of G on Γ is defined by a map which assigns to each oriented edge, e, of Γ, a one-dimensional representation of G (or, alternatively, a weight, αe, in the weight lattice of G. For the assignment, e → αe, to be a schematic description of a " G-action " , these weights have to satisfy certain compatibility conditions: th...

Persistence in discrete Morse theory